On domination critical graphs with cutvertices having connected domination number 3
نویسندگان
چکیده
منابع مشابه
On Domination Critical Graphs with Cutvertices having Connected Domination Number 3
A subset of vertices D of a graph G is a dominating set for G if every vertex of G not in D is adjacent to one in D. A dominating set for G is a connected dominating set if it induces a connected subgraph of G. The connected domination number of G, denoted by γc(G), is the minimum cardinality of a connected dominating set. Graph G is said to be k−γc−critical if γc(G) = k but γc(G+e) < k for eac...
متن کاملCritical graphs with respect to total domination and connected domination
A graph G is said to be k-γt-critical if the total domination number γt(G) = k and γt(G + uv) < k for every uv / ∈ E(G). A k-γc-critical graph G is a graph with the connected domination number γc(G) = k and γc(G + uv) < k for every uv / ∈ E(G). Further, a k-tvc graph is a graph with γt(G) = k and γt(G− v) < k for all v ∈ V (G), where v is not a support vertex (i.e. all neighbors of v have degre...
متن کامل3 - Chromatic Cubic Graphs with Complementary Connected Domination Number Three
Let G (V, E) be a graph. A subset S of V is called a dominating set of G if every vertex in V-S is adjacent to at least one vertex in S. The domination number γ (G) is the minimum cardinality taken over all such dominating sets in G. A subset S of V is said to be a complementary connected dominating set (ccd-set) if S is a dominating set and < V-S > is connected. The chromatic number χ is the m...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملThe edge domination number of connected graphs
A subset X of edges in a graph G is called an edge dominating set of G if every edge not in X is adjacent to some edge in X. The edge domination number γ′(G) of G is the minimum cardinality taken over all edge dominating sets of G. Let m,n and k be positive integers with n − 1 ≤ m ≤ (n 2 ) , G(m,n) be the set of all non-isomorphic connected graphs of order n and size m, and G(m,n; k) = {G ∈ G(m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2007
ISSN: 1314-7536
DOI: 10.12988/imf.2007.07277